One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs
نویسنده
چکیده
In this paper, we study connections among one-way functions, hard on the average problems, and statistical zero-knowledge proofs. In particular, we show how these three notions are related and how the third notion can be better characterized, assuming the rst one.
منابع مشابه
Unconditional Characterizations of Non-interactive Zero-Knowledge
Non-interactive zero-knowledge (NIZK) proofs have been investigated in two models: the Public Parameter model and the Secret Parameter model. In the former, a public string is “ideally” chosen according to some efficiently samplable distribution and made available to both the Prover and Verifier. In the latter, the parties instead obtain correlated (possibly different) private strings. To add f...
متن کاملOn the Impossibility of Constructing Non-interactive Statistically-Secret Protocols from Any Trapdoor One-Way Function
We show that non-interactive statistically-secret bit commitment cannot be constructed from arbitrary black-box one-to-one trapdoor functions and thus from general public-key cryptosystems. Reducing the problems of non-interactive crypto-computing, rerandomizable encryption, and non-interactive statistically-sender-private oblivious transfer and low-communication private information retrieval t...
متن کاملOn the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
Statistical Zero-knowledge proofs (Goldwasser, Micali and Rackoff, SICOMP 1989) allow a computationally unbounded server to convince a computationally limited client that an input x is in a language Π without revealing any additional information about x that the client cannot compute by herself. Randomized encoding (RE) of functions (Ishai and Kushilevitz, FOCS 2000) allows a computationally li...
متن کاملOne-Way Fuctions are Essential for Non-Trivial Zero-Knowledge
It was known that if one-way functions exist, then there are zero-knowledge proofs for every language in PSPACE . We prove that unless very weak one-way functions exist, ZeroKnowledge proofs can be given only for languages in BPP. For average-case de nitions of BPP we prove an analogous result under the assumption that uniform one-way functions do not exist. Thus, very loosely speaking, zero{kn...
متن کاملOne-Way Functions are Essential for Non-Trivial Zero-Knowledge
It was known that if one-way functions exist, then there are zero-knowledge proofs for every language in PSPACE . We prove that unless very weak one-way functions exist, ZeroKnowledge proofs can be given only for languages in BPP. For average-case definitions of BPP we prove an analogue result under the assumption that uniform one-way functions do not exist. ∗ University of California at Berkel...
متن کامل